Sets uniquely determined by projections on axes II Discrete case

نویسندگان

  • Peter C. Fishburn
  • Jeffrey C. Lagarias
  • James A. Reeds
  • Larry A. Shepp
چکیده

Fishburn, P. A subset S of N " = { 1,2,. , N} " is a discrete set of uniqueness if it is the only subset of N " with projections P,, Sets of uniqueness and additive sets are characterized by the absence of certain configurations in the lattice N ". The characterization shows that every additive set is a set of uniqueness. If n = 2, every set of uniqueness is also additive. However, when II 3 3, there are sets of uniqueness that are not additive.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstruction of 8-connected but not 4-connected hv-convex discrete sets

The reconstruction of 8-connected but not 4-connectedhv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m, n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity ...

متن کامل

Stability results for uniquely determined sets from two directions in discrete tomography

In this paper we prove several new stability results for the reconstruction of binary images from two projections. We consider an original image that is uniquely determined by its projections and possible reconstructions from slightly different projections. We show that for a given difference in the projections, the reconstruction can only be disjoint from the original image if the size of the ...

متن کامل

Reconstruction of convex 2D discrete sets in polynomial time

The reconstruction problem is considered in those classes of discrete sets where the reconstruction can be performed from two projections in polynomial time. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex 8-connected sets, hv-convex polyominoes, and directed h-convex sets. As new results some properties of the feet and spines of the ...

متن کامل

An algorithm for the reconstruction of discrete sets from two projections in presence of absorption

In this paperwe consider the problemof reconstructing a binarymatrix fromabsorbedprojections, as introduced in [Kuba and Nivat, LinearAlgebraAppl. 339 (2001) 171–194]. In particular we prove that two left and right horizontal absorbed projections along a single direction uniquely determine a row of a binary matrix for a specific absorption coefficient. Moreover, we give a linear time algorithm ...

متن کامل

Inverse Problem for Interior Spectral Data of the Dirac Operator with Discontinuous Conditions

In this paper, we study the inverse problem for Dirac differential operators with  discontinuity conditions in a compact interval. It is shown that the potential functions can be uniquely determined by the value of the potential on some interval and parts of two sets of eigenvalues. Also, it is shown that the potential function can be uniquely determined by a part of a set of values of eigenfun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 91  شماره 

صفحات  -

تاریخ انتشار 1991